The threshold for the square of a Hamilton cycle
نویسندگان
چکیده
Resolving a conjecture of Kühn and Osthus from 2012, we show that p = 1 / n p= 1/\sqrt {n} is the threshold for random graph alttext="upper G Subscript comma p"> G , encoding="application/x-tex">G_{n,p} to contain square Hamilton cycle.
منابع مشابه
investigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
study of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
the use of appropriate madm model for ranking the vendors of mci equipments using fuzzy approach
abstract nowadays, the science of decision making has been paid to more attention due to the complexity of the problems of suppliers selection. as known, one of the efficient tools in economic and human resources development is the extension of communication networks in developing countries. so, the proper selection of suppliers of tc equipments is of concern very much. in this study, a ...
15 صفحه اولA sharp threshold for the Hamilton cycle Maker-Breaker game
We study the Hamilton cycle Maker-Breaker game, played on the edges of the random graph G(n, p). We prove a conjecture from [13], asserting that the property that Maker is able to win this game, has a sharp threshold at log n n . Our theorem can be considered a game-theoretic strengthening of classical results from the theory of random graphs: not only does G(n, p) almost surely admit a Hamilto...
متن کاملOn Degree Sequences Forcing The Square of a Hamilton Cycle
A famous conjecture of Pósa from 1962 asserts that every graph on n vertices and with minimum degree at least 2n/3 contains the square of a Hamilton cycle. The conjecture was proven for large graphs in 1996 by Komlós, Sárközy and Szemerédi [23]. In this paper we prove a degree sequence version of Pósa’s conjecture: Given any η > 0, every graph G of sufficiently large order n contains the square...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2021
ISSN: ['2330-1511']
DOI: https://doi.org/10.1090/proc/15419